Approximability of the Multiple Stack TSP

STSP seeks a pair of pickup and delivery tours in two distinct networks, where the two tours are related by LIFO contraints. We address here the problem approximability. We notably establish that asymmetric MaxSTSP and MinSTSP12 are APX, and propose a heuristic that yields to a 1/2, 3/4 and 3/2 standard approximation for respectively Max2STSP, Max2STSP12 and Min2STSP12

The complexity of the Pk partition problem and related problems in bipartite graphs

In this paper, we continue the investigation made in [MT05] about the approximability of Pk partition problems, but focusing here on their complexity. Precisely, we aim at designing the frontier between polynomial and NP-complete versions of the Pk partition problem in bipartite graphs, according to both the constant k and the maximum degree of the input graph. We actually extend the obtained results to more general classes of problems, namely, the minimum k-path partition problem and the maximum Pk packing problem. Moreover, we propose some simple approximation algorithms for those problems

Approximation algorithms for the traveling salesman problem

We first prove that the minimum and maximum traveling salesman problems, their metric versions as well as some versions defined on parameterized triangle inequalities (called sharpened and relaxed metric traveling salesman) are all equi-approximable under an approximation measure, called differential-approximation ratio, that measures how the value of an approximate solution is placed in the interval between the worst- and the best-value solutions of an instance. We next show that the 2-OPT, one of the most-known traveling salesman algorithms, approximately solves all these problems within differential-approximation ratio bounded above by 1/2. We analyze the approximation behavior of 2-OPT when used to approximately solve traveling salesman problem in bipartite graphs and prove that it achieves differential-approximation ratio bounded above by 1/2 also in this case. We also prove that, it is NP-hard to differentially approximate metric traveling salesman within better than 649/650 and traveling salesman with distances 1 and 2 within better than 741/742. Finally, we study the standard approximation of the maximum sharpened and relaxed metric traveling salesman problems. These are versions of maximum metric traveling salesman defined on parameterized triangle inequalities and, to our knowledge, they have not been studied until now

Le voyageur de commerce et ses variations : un tour d'horizon de ses résolution

[extrait de l'intro] La difficulté de résolution du TSP a d'autant plus porté sur lui l'attention des chercheurs. Aussi a-t-il été étudié et retourné sous tous les angles~: théorie des graphes, programmation linéaire, programmation dynamique, optima locaux, etc. Les premières formalisations de la recherche exhaustive par la stratégie d'évaluation et séparation seraient même nées de recherches sur le voyageur de commerce. Ce chapitre retrace, certainement pas de façon exhaustive, l'histoire conjointe de la recherche opérationnelle et du voyageur de commerce. Après avoir présenté le problème, nous proposons des algorithmes, exacts puis approchés, pour différentes versions du problème~: minimisation ou maximisation, instances métriques, distances binaires, etc. Certains de ces algorithmes mettent en oeuvre des modèles généraux de résolution tels que la stratégie par séparation et évaluation, la programmation dynamique ou la recherche locale. Certains encore utilisent des heuristiques, qui ne sont autres que des idées de bon sens quant à la constitution d'une solution pour le problème étudié~: nous pensons par exemple aux heuristiques du regret et du plus proche voisin. D'autres enfin, exploitant la relative facilité de sous-problèmes du TSP, partent d'une solution de ces sous-problèmes et construisent à partir de celle-ci un cycle hamiltonien~; c'est le parti pris par l'algorithme de Christofides avec l'arbre couvrant, mais de nombreux résultats sont également obtenus par le biais d'un 2-couplage optimal

Approximation différentielle : histoire, motivations, enjeux

pp 423-424Cette présentation arborde l'approximation différentielle sous deux angles essentiels : le premier concerne les algorithmes à garantie de performance et consiste à mener une réflexion quant à la notion même de garantie ; le second s'intéresse pour sa part aux aspects fondamentaux de l'approximation en discutant des question cruciales levées par l'analyse différentielle quant à la structuration induite de NPO

Pk partition problem and related problems in bipartite graphs

In this paper, we continue the investigation proposed in [15] about the approximability of P k partition problems, but focusing here on their complexity. More precisely, we prove that the problem consisting of deciding if a graph of nk vertices has n vertex disjoint simple paths {P 1, ⋯ ,P n } such that each path P i has k vertices is NP-complete, even in bipartite graphs of maximum degree 3. Note that this result also holds when each path P i is chordless in G[V(P i )]. Then, we prove that the optimization version of these problems, denoted by Max P 3 Packing and MaxInduced P 3 Packing, are not in PTAS in bipartite graphs of maximum degree 3. Finally, we propose a 3/2-approximation for Min3-PathPartition in general graphs within O(nm + n 2logn) time and a 1/3 (resp., 1/2)-approximation for MaxW P 3 Packing in general (resp., bipartite) graphs of maximum degree 3 within O(α(n,3n/2)n) (resp., O(n 2logn)) time, where α is the inverse Ackerman’s function and n = |V|, m = |E|.ou

Approximation results for the weighted P4 partition problem

Abstract. We present several new standard and differential approximation results for P4-partition problem by using the algorithm proposed in Hassin and Rubinstein (Information Processing Letters, 63: 63-67, 1997), for both minimization and maximization versions of the problem. However, the main point of this paper is the robustness of this algorithm, since it provides good solutions, whatever version of the problem we deal with, whatever the approximation framework within which we estimate its approximate solutions

The path partition problem and related problems in bipartite graphs

International audienceWe prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some approximation and inapproximation results for several related problems